Induced Trees in Triangle-Free Graphs
نویسندگان
چکیده
We prove that every connected triangle-free graph on n vertices contains an induced tree on exp(c √ log n ) vertices, where c is a positive constant. The best known upper bound is (2 + o(1)) √ n. This partially answers questions of Erdős, Saks, and Sós and of Pultr.
منابع مشابه
Fast Distributed Coloring Algorithms for Triangle-Free Graphs
Vertex coloring is a central concept in graph theory and an important symmetry-breaking primitive in distributed computing. Whereas degree-∆ graphs may require palettes of∆+1 colors in the worst case, it is well known that the chromatic number of many natural graph classes can be much smaller. In this paper we give new distributed algorithms to find (∆/k)-coloring in graphs of girth 4 (triangle...
متن کاملDistributed coloring algorithms for triangle-free graphs
Vertex coloring is a central concept in graph theory and an important symmetry-breaking primitive in distributed computing. Whereas degree-∆ graphs may require palettes of ∆+1 colors in the worst case, it is well known that the chromatic number of many natural graph classes can be much smaller. In this paper we give new distributed algorithms to find (∆/k)-coloring in graphs of girth 4 (triangl...
متن کاملRooted induced trees in triangle-free graphs
For a graph G, let t(G) denote the maximum number of vertices in an induced subgraph of G that is a tree. Further, for a vertex v ∈ V (G), let t(G, v) denote the maximum number of vertices in an induced subgraph of G that is a tree, with the extra condition that the tree must contain v. The minimum of t(G) (t(G, v), respectively) over all connected triangle-free graphs G (and vertices v ∈ V (G)...
متن کاملA Polynomial Time Graph Isomorphism Algorithm For Graphs That Are Not Locally Triangle-Free
In this paper, we show the existence of a polynomial time graph isomorphism algorithm for a restricted class of graphs which are not triangle-free graphs. We consider graphs that have atleast 2 vertices in all rearranged sub-graphs. An Individualization-Refinement procedure(1 Dimensional Weisfeiler-Lehman Method) is used to rearrange one graph which splits the graph into disjoint vertex sets. T...
متن کاملBounded Clique-Width of ($S_{1, 2, 2}$, Triangle)-Free Graphs
If a graph has no induced subgraph isomorphic to H1 or H2 then it is said to be (H1, H2)-free. Dabrowski and Paulusma found 13 open cases for the question whether the clique-width of (H1, H2)-free graphs is bounded. One of them is the class of (S1,2,2,triangle)-free graphs. In this paper we show that these graphs have bounded clique-width. Thus, also (P1+2P2,triangle)-free graphs have bounded c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 29 شماره
صفحات -
تاریخ انتشار 2007